Kind inference for datatypes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Yet Another Yacc for Datatypes

A parser generator automatically constructs a parser from a description of an input syntax. In this paper we discuss the Term Processor, a system that automatically constructs data structures from a simple, abstract description. In the same way as a parser generator allows functions that operate during parsing, e.g. for semantic analysis, our system allows the description and generation of func...

متن کامل

Manufacturing datatypes

This paper describes a general framework for designing purely functional datatypes that automatically satisfy given size or structural constraints. Using the framework we develop implementations of different matrix types (eg square matrices) and implementations of several tree types (eg Braun trees, 2-3 trees). Consider, for instance, representing square n n matrices. The usual representation u...

متن کامل

Deriving class instances for datatypes

We provide a framework for registering automatic methods to derive class instances of datatypes, as it is possible using Haskell’s “deriving Ord, Show, . . . ” feature. We further implemented such automatic methods to derive (linear) orders or hash-functions which are required in the Isabelle Collection Framework [1] and the Container Framework [2]. Moreover, for the tactic of Huffman and Kraus...

متن کامل

RFC 4316 Datatypes for WebDAV

Datatypes for Web Distributed Authoring and Versioning (WebDAV) Properties Status of This Memo This memo defines an Experimental Protocol for the Internet community. It does not specify an Internet standard of any kind. Discussion and suggestions for improvement are requested. Distribution of this memo is unlimited. Abstract This specification extends the Web Distributed Authoring and Versionin...

متن کامل

Inference Graphs: A New Kind of Hybrid Reasoning System

Hybrid reasoners combine multiple types of reasoning, usually subsumption and Prolog-style resolution. We outline a system which combines natural deduction and subsumption reasoning using Inference Graphs implementing a Logic of Arbitrary and Indefinite Objects.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ACM on Programming Languages

سال: 2020

ISSN: 2475-1421

DOI: 10.1145/3371121